Dissertation Abstract: SAT/SMT techniques for planning problems
ثبت نشده
چکیده
Although a lot of work has been devoted to the encoding of planning tasks to propositional logic, only a few works can be found in the literature on satisfiability based approaches to planning in domains that require numeric reasoning. This is probably due to the difficulty of efficiently handling at the same time numeric constraints and propositional formulas. Surprisingly, satisfiability modulo theories (SMT) has been scarcely considered in planning, despite being an active and growing area of research. Since SMT is the natural extension of SAT when propositional formulas need to be combined with numeric constraints, we think it is worth considering SMT for SAT-based planning with numeric domains. The purpose of this thesis is to adapt and take advantage of the expressivity of SMT technology for solving planning problems with numerical constraints. Nevertheless, we remark that most of the results accomplished are generalized to SMT, not just SAT modulo linear arithmetic.
منابع مشابه
Dissertation Abstract: Sat/smt Techniques for Planning Problems
Although a lot of work has been devoted to the encoding of planning tasks to propositional logic, only a few works can be found in the literature on satisfiability based approaches to planning in domains that require numeric reasoning. This is probably due to the difficulty of efficiently handling at the same time numeric constraints and propositional formulas. Surprisingly, satisfiability modu...
متن کاملOn SAT Modulo Theories and Optimization Problems
Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verification) problems over theories such as the integers, arrays, or equality. Here we show that SMT approaches can also efficiently solve problems that, at first sight, do not have a typical SMT flavor. In particular, here we deal with SAT and SMT problems where models M are sought s...
متن کاملTutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning
Constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, extended static checking, test-case generation, scheduling, planning, graph problems, among others. The most well-known constraint satisfaction problem is propositional satisfiability SAT. Of particular recent interest is satisfiability modulo theories (SMT), where the inte...
متن کاملSAT Encodings of State-Space Reachability Problems in Numeric Domains
Translation to Boolean satisfiability is an important approach for solving state-space reachability problems that arise in planning and verification. Many important problems, however, involve numeric variables; for example, C programs or planning with resources. Focussing on planning, we propose a method for translating such problems into propositional SAT, based on an approximation of reachabl...
متن کاملSAT Modulo Monotonic Theories
Boolean satisfiability (SAT) solvers have been successfully applied to a wide variety of difficult combinatorial problems. Many further problems can be solved by SAT Modulo Theory (SMT) solvers, which extend SAT solvers to handle additional types of constraints. However, building efficient SMT solvers is often very difficult. In this paper, we define the concept of a Boolean monotonic theory an...
متن کامل